Data asset reconstruction

ABSTRACT

According to an aspect, data asset reconstruction includes receiving a data lineage for a data asset, where the data lineage identifies a data source connected to the data asset by an intermediate process. It is determined whether the intermediate process can be used to reconstruct a lost data asset. Based on determining that the intermediate process can be used to reconstruct the lost data asset, reconstructing the lost data asset with the intermediate process and the data source.

DOMESTIC PRIORITY

This application is a continuation of U.S. patent application Ser. No.14/576,241, filed Dec. 19, 2014, the content of which is incorporated byreference herein in its entirety.

BACKGROUND

The present invention relates generally to reconstruction of a dataasset. More specifically, embodiments described herein include partialand total reconstruction of data that may have been lost, for example,in a natural disaster, and was either not backed up properly, or thebackup was lost as well.

SUMMARY

Embodiments include a system, method, and computer program product fordata asset reconstruction. The method includes receiving a data lineagefor a data asset, where the data lineage identifies a data sourceconnected to the data asset by an intermediate process. It is determinedwhether the intermediate process can be used to reconstruct a lost dataasset. Based on determining that the intermediate process can be used toreconstruct the lost data asset, reconstructing the lost data asset withthe intermediate process and the data source.

Additional features and advantages are realized through the techniquesof the present disclosure. Other embodiments and aspects of thedisclosure are described in detail herein. For a better understanding ofthe disclosure with the advantages and the features, refer to thedescription and to the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The forgoing and other features, and advantages ofthe invention are apparent from the following detailed description takenin conjunction with the accompanying drawings in which:

FIG. 1 is a block diagram of a system to provide a data lineage for adata asset in accordance with an embodiment;

FIG. 2 is a simplified flowchart illustration of an exemplary embodimentof a method of data reconstruction;

FIG. 3 is a block diagram of an example data flow when reconstructing adata asset in accordance with an embodiment;

FIGS. 4A, 4B and 4C are example flowcharts illustrating an embodiment ofa method for data asset reconstruction;

FIG. 5 is a block diagram depicting an example of a tangible,non-transitory computer-readable medium that can be used to reconstructa data asset; and

FIG. 6 shows example pseudo code illustrating a method to reconstruct adata asset in accordance with an embodiment.

DETAILED DESCRIPTION

The subject matter disclosed herein relates to techniques forreconstructing a data asset. Enterprise computer systems or any othercomputer systems that use stored data rely on data assets. Data assetscan be used to run an enterprise system's operational systems, togenerate analytics, and in other reporting that enables timely businessdecisions. It is possible that a data asset can be lost in anirrecoverable way, for example through a natural disaster. The loss of adata asset may impact the core functioning of an enterprise. Many dataasset systems implement disaster or loss recovery programs that protectdata assets through backup programs, as one example. However, presentbackup solutions are not always ideal because a backup of the data assetmay itself have been lost in the same disaster. Further, a particulardata asset that is lost may not have been backed up due to negligence orerror.

In the present disclosure, it is possible that lost data can bereconstructed even when the backup is lost or non-existent. Further,this disclosure outlines a number of techniques to minimize the number,frequency, and scope of situations in which a backup is needed as manydata assets can be fully recovered using the presently disclosedtechniques without needing a backup. This disclosure describes, in part,a new method for reconstructing a lost data asset. As seen in thefigures and illustrations, a data asset may exist within the context ofa larger data flow in that there may be upstream process and downstreamprocesses to the data asset. An upstream process may write data to thedata asset from an upstream data asset or data source. A downstreamprocess may read data from the data asset and write it to a downstreamasset or data source. Examples of processes executed to and from a dataasset include extract, transform, and load (ETL) jobs that read fromoperational systems and write to a data warehouse. Another exampleprocess includes data lifecycle management tools that read from awarehouse to create test data. Another example process includes theprocess of reporting a reading of a data mart or any other layer of adata warehouse environment that is used to get data out to the users.For example, instead of a data mart, the reading could be of a subset ofa data warehouse that is usually oriented to a specific slice of thetotal warehouse. In one embodiment, this reading may be done by anextension that enables analytics.

FIG. 1 is a block diagram of a system to provide a data lineage for adata asset in accordance with an embodiment. In the system of FIG. 1, adata asset 100 may be populated by one or more jobs 102, such asextract, transform, and load (ETL) jobs well-known in the datawarehousing arts. The data asset may be a data warehouse, database, andmay also be an accumulation of computed data in a physical space,storage, memory, server, or other similar device.

Jobs 102 may refer by name to specific databases and fields, or mayinstead be data for use with different databases whose names and fieldsare known to jobs 102 at runtime. In one example, jobs 102 includesintermediate processes used to transport, generate, alter, or removedata from a data asset or data store. A log 104 may also be kept inwhich operational information is recorded when any of jobs 102 are run.One or more database schemas 106 describing the databases accessed byjobs 102 may also be included in the system provided.

The system may also include a computing device 108 to interface withdata storage 110. The data storage 110 may include multiple and separateunits for storing data including data store A 112, data store B 114, anddata store C 116. The data used to initially generate the data asset 100may come from a single data store unit, for example, data store A 112.Alternatively, the data asset may have been originally generated fromdata that originally came from a combination of data store unites, forexample, data store B 114 and data store C 116. In another embodiment,the data stored in the data storage 110 or any of the storage units itcontains may have been generated from the data asset 100.

The system may also include a data reconstructor 118 which may combineinformation from jobs 102, logs 104, and schemas 106 to obtain a datalineage 120 for the data asset 100. In some cases, the datareconstructor 118 may be implemented as logic, as hardware logic, orsoftware configured to be carried out by a computing device, such as thecomputing device 118. In another embodiment, the data lineage 120 mayhave previously been generated for the data asset 100 and used by thedata reconstructor 118 only when reconstructing a lost data asset 100.

As one example of how a data lineage may be formed, the data lineage ofa GrossSales object of data asset 100 may be expressed to the datareconstructor 118 by identifying a) which job in log 104 wrote toGrossSales, b) what data was read by that job, and c) which other job104 wrote that data. Steps b) and c) may be performed recursively alongone or more paths within log 104 as required until one or more jobs arearrived at whose data sources are not traceable within log 104 to otherjobs. The identified job path may then be combined with information fromthe jobs 102 that traversed along the job path, such as job commands orother job metadata, as well as with information regarding the schemas106 referred to by log 104. Database names and other database parametersthat are passed to a job along the job path may be inserted into thelineage in place of the job parameter variables. Thus, the parameters ofa Job 102 may be replaced with database names or other databaseparameters that may indicate a link of a particular job 102 to a datasource such as data source A 112, data source B 114, or data source C114, as indicated by log 104.

Any of the elements of the embodiments referred to herein may be storedon, executed by, and/or otherwise managed by one or more computerdevices 108 having access to a data storage 110 which may be a magneticmemory and/or any other known data storage device.

FIG. 2 is a simplified flowchart illustration of a method of datareconstruction in accordance with an embodiment. In some embodiments,the exemplary method of FIG. 2 may be executed on the system pictured inFIG. 1, however the method is not limited only to that system.

At block 200, a data lineage for a lost data asset is obtained. Thisdata lineage may be obtained as shown in the example discussed above, ormay also be provided from data storage 110. The data lineage of the lostdata asset may include any upstream or downstream processes. An upstreamprocess may write data to the data asset from an upstream data asset. Adownstream process may read data from the data asset and write it to adownstream asset or data source and may manipulate the data prior towriting it on the downstream asset. In some examples, the upstream anddownstream data assets may each be located on a data source.

At block 202, each process is analyzed to see if they can be used toreconstruct the lost data asset 100. Upstream processes are analyzed tosee if they can be rerun. Downstream processes are analyzed to see ifthey can be reverse-run. The processes that can be reverse-run arereversible.

At block 204, if an upstream process can be rerun, the data asset isreconstructed by rerunning the upstream process. A downstream processmay also be used if no upstream process is runnable or if all upstreamprocesses only partially reconstructed the data asset. If this is thecase, a reversible downstream process may be used to reconstruct thedata from a downstream data source.

As data reconstruction in this manner relies in part upon navigating theupstream and downstream processes and data sources, a data lineage thatidentifies the processes and data assets is useful in reconstructing alost data asset. Further, in determining whether to pursue an upstreamor a downstream process, a “recreation score” may be calculated prior toreconstructing with either process. The recreation score may be a valueindicating the likelihood that lost data may be reconstructed for thedata asset. The recreation score may be based on the number of upstreamprocesses that are able to be rerun, for example. In some otherexamples, the recreation score may be the percentage of the lost dataasset that is at a certain level or percentage reconstructed. Once arecreation score is calculated, the processes may be pursed in an orderthat reconstructs as much of the data asset with as few processes aspossible.

FIG. 3 is a block diagram of an example data flow when reconstructing adata asset in accordance with an embodiment. This figure, in part,illustrates how a data asset exists within the context of a larger dataflow, specifically showing how there are upstream processes that writedata to it from upstream assets. This figure also shows how there aredownstream processes that read data from it and write to downstreamassets.

A lost data asset 300 may have been generated prior to its destructionor absence by upstream jobs and upstream data assets 302. Conversely, alost data asset 300 may also be used to generate, prior to itsdestruction or absence, a number of downstream data assets 304. Eachprocess, function, or operation between the lost data asset 300 and adata source can be known as an intermediate process. A data source, asreferred to herein, may include an upstream asset, a downstream asset,or any combination thereof. In some examples, the lost data asset 300may have been originally generated from multiples data sources, such asdata asset B 310 and data asset C 312. The use of multiple sources mayinclude their own intermediate processes, such as job B 314 and job D316. As shown, not every intermediate process is paired exclusively to adata source, and in some cases the original generation of the data assetmay have included a job C 318 which was not directly linked to any dataasset, but instead may have included a job to be executed iteratively onexisting data asset data, or instead simultaneous to anotherintermediate process such as job B 314.

When reconstructing the lost data asset 300, if it is determined that aparticular data source and a particular intermediate process arererunable, the lost data asset 300 can be reconstructed by rerunning theintermediate process. For example, an upstream rerunable job A 308 couldhave been executed upon its corresponding data source, here data asset A306, in order to generate the lost data asset 300. If process A 308 isrerunable and if the data asset A 306 exists, then the lost data asset300 can be reconstructed by rerunning this intermediate process with thedata source.

A lost data asset 300 may also have been used in the generation ofdownstream data sources such as data asset D 320. The generation of thisdownstream data source may include the execution of several intermediateprocesses such as job E 322, job F 324, and job G 326 on the lost dataasset 300 prior to it being lost. These jobs may have each independentlybeen sufficient to generate data asset D 320. Alternatively, these jobsmay have been used simultaneously or in a particular sequence, such asE-F-G in order to generate data asset D.

When reconstructing the lost data asset 300, if it is determined that aparticular data source and a particular intermediate process arereversible, lost data asset 300 could be reconstructed by reversing theintermediate process. For example, the downstream reversible job E 322could have been reversed and executed upon its corresponding datasource, here data asset D 320, in order to generate the lost data asset300. If several intermediate processes were executed in sequence tooriginally generate a data store such as data asset A, and each of theseintermediate processes are reversible, then they can be used toreconstruct the lost data asset 300. For example, assume data asset D320 is originally generated by the lost data asset 300 executingreversible jobs in the flowing sequence: job E 322, job F 324, and thenjob G 326. To reconstruct the lost data asset 300, these jobs should bereversible such that the reverse function or operation is performed ifthey are applied AND the sequence they were applied in should also bereversed. For example the reverse of each job would be applied to thedata source, in this example data asset D, in the following order: thereverse of job G 326, the reverse of job F 324, and the reverse of job E322.

As appreciated by one skilled in the art, embodiments may include asystem, method or computer program product. Accordingly, embodiments maytake the form of an entirely hardware embodiment, an entirely softwareembodiment (including firmware, resident software, micro-code, etc.) oran embodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, embodiments may take the form of a computer program productembodied in one or more computer readable medium(s) having computerreadable program code embodied thereon.

FIGS. 4A, 4B and 4C are example flowcharts illustrating one embodimentof a method 400 for data asset reconstruction. The data lineage ispresumed as known within the scope of each of these figures.

In FIG. 4A addresses one version of the reconstruction method 400 priorto management of various upstream or downstream processes. At block 402,a node to reconstruct is identified. This node can be a data asset withpartially missing data, or a former data asset which has since beencompletely wiped out by a natural disaster, system error, or any othercause resulting in lost data.

At block 404, an edge is identified for the node. The edge may be anyprocess or function that handled data and is connected to the node. Insome embodiments, the edge can be an intermediate process used inreconstruction.

At block 406, it may be determined if the source of the data for handedby the edge exists. If the source for the edge does not exist, processflow proceeds to block 408. A source of data may not exist for a numberof reasons, including the edge was operating on data that was temporaryor intermediate data and accordingly had no record. A source of data maynot exist also if it was deleted, destroyed, or never created.

At block 408, the source of the data is reconstructed in the same manneras a node is reconstructed. Specifically, this step invokes a recursivereconstruction loop that can substitute the absent source of the datauntil a source of data is located and the intermediate sources of dataor nodes may be reconstructed sufficiently to allow process flow toproceed to block 410. The feature allowing the process to restart foranother node at block 402 prior to reconstructing the current node. Inthis way, a data source may be viewed as a first data source, anintermediate process may be viewed as a first intermediate process, anda data lineage may be viewed as a first data lineage. The method mayidentify a second lost data asset of the first data source upon whichreconstruction of the first lost data asset depends. To reconstruct thesecond lost data asset, the method may invoke itself such that a seconddata lineage is received for the second lost data asset. The second datalineage may identify at least a second data source connected to thesecond lost data asset by a second intermediate process. The method thencan allow the reconstruction of the second lost data asset with thesecond intermediate process and the second data source prior toreconstructing the first lost data asset. However, if at block 406, itwas determined that the node did exist, process flow proceeds to block410.

At block 410, it is determined if the edge is an upstream edge or adownstream edge. If the edge is an upstream edge, process flows to FIG.4B and block 412. If the edge is a downstream edge, process flows toFIG. 4C and block 418.

In FIG. 4B, the method 400 of reconstructing a node illustrates one wayan upstream edge may be used to reconstruct a node. At block 412, it isdetermined if the upstream edge can be rerun. If no, the upstream edgeis not rerunable, process flow proceeds to block 414. If at block 412,yes, the upstream edge is rerunable, then process flow proceeds to block416.

At block 414, a different edge for the node is identified. This mayinclude returning to FIG. 4A block 404 to identify an edge for the node.At block 416, the upstream edge is rerun to reconstruct the node.Although this method refers to only a single upstream edge to fullyreconstruct a node, rerunning of multiple upstream edges to reconstructpartial node data is also within the scope of this process.

In FIG. 4C, a downstream edge may be used to reconstruct the node. Atblock 418, it is determined if the downstream edge is reversible. If thedownstream edge is not reversible, process flow proceeds to block 420.If at block 418, the upstream edge is reversible, then process flowproceeds to block 422.

At block 420, a different edge for the node is identified. This mayinclude returning to FIG. 4A block 404 to identify an edge for the node.At block 422, the downstream edge is reversed and applied to the datasource to reconstruct the node. Although this method refers to only asingle downstream edge to fully reconstruct a node, reversing and use ofmultiple downstream edges to reconstruct partial node data is alsowithin the scope of this process.

FIG. 5 is a block diagram depicting an example of a tangible,non-transitory computer-readable medium 500 that can be used toreconstruct a data asset in accordance with an embodiment. Thecomputer-readable medium 500 may be communicatively coupled to aprocessor 502 by a bus 504. The processor 502 is enabled to executeinstructions and commands sent from the computer-readable medium inorder to yield a result.

In one example, the computer-readable medium 500 contains a data lineageobtainer 506 which obtains a data lineage for a lost data asset. Thedata lineage obtainer 506 may obtain a data lineage by creating it asshown in any example above, or it may also retrieve it from a storedlocation.

The computer-readable medium may also include a process analyzer 508used for analyzing if processes are rerunable, reversible, and if theprocesses are upstream or downstream processes. The computer readablemedium may also include a data reconstructor 510. The data reconstructor510 may be used to implement the appropriate process as designated bythe process analyzer 508. When reconstructing data, the datareconstructor 510 may work with both a process and a data source toyield the lost data asset.

FIG. 6 shows example pseudo code 600 illustrating the method toreconstruct a data asset in accordance with an embodiment. In additionto the figures above, another example method is shown in a pseudo codeformat highlighting the data asset manipulations, identifications, andanalysis through the reconstruction process. In this pseudo codeexcerpt, it is assumed that a node graph is known, where each noderepresents a data asset. Further, in the pseudo code excerpt, each edgerepresents a process which may be an intermediate process. Each edge mayfurther move data from a source node to a target node.

The pseudo code in this example is invoked on the node that needs to bereconstructed. From there the pseudo code traverses the known lineagegraph to find nodes that were not damaged and can be used directly orindirectly to recreate the initial role.

Various helper methods are used in the pseudo code 600 includingexist(node), isReRunable(edge), isReversible(edge), reverseRun(edge),and rerun(edge). The method “exist(node)” checks if node was damaged orif the data is still accessible. The method “isReRunnable(edge)” checksif the process can be run again, and thereby creating the data it wrotewhen it ran last. The method “isReversible(edge)” checks if the processcan be run in reverse, and thereby creating the data it read when it ranlast. The method “reverseRun(edge)” runs a process in reverse, andthereby creating the data it read when it ran last. The method“reRun(edge)” runs a process again, and thereby creating the data itwrote when it ran last.

The method “isReRunnable(edge)” checks if the process can be run again,and thereby create the data it wrote when it ran last. For example, Aprocess is re-run-able if 1) the source data that the process read fromstill exists, partially or totally. A process is also re-run-able if 2)either the process did not change the source data, (i.e. it performed aread only operation) and the source data has not changed since theprocess ran last or if the source data was changed by a known one-to-onefunction.

The method “rerun(edge)” runs a process again and thereby creates thedata it wrote when it ran last. If the process did not change the sourcedata and the source data has not changed since the process ran last, theprocess that the edge represents is rerun. If the source data waschanged by a known one-to-one function, namely f(x), then the reversefunction f⁻¹(x) needs to be applied to the data and then rerun theprocess that the edge represents.

The method “isReversible(edge)” checks if the process can be run inreverse, and thereby create the data it read when it ran last.Specifically, there are various types of functions that comprise aprocess. For example, 1) Non reversible functions—e.g. Aggregation,Average, Absolute Value; 2) Partially reversible—e.g. Upper, Pad, Trim;and 3) Reversible—e.g. Compress, Divide, Logical Not. If a processcontains one or more functions of type 1, it is not reversible. If aprocess contains one or more functions of type 2 and no functions oftype 1, it is partially reversible. This means the process can bereversed, but there can be some data loss. If a process contains onlyfunctions of type 3, it is fully reversible

The method “reverseRun(edge)” runs in reverse, and thereby creates thedata it read when it read last. As background, a process is comprised offunctions. Further, a process can be reversed by creating a new processthat reverses the overall functionality of the initial process.Specifically, this is done by using compensating functions. Thefollowing list shows some functions and their compensating function:Encode→Decode; Compress→Expand; Divide→Multiply; Lookup→Reverse Lookup;Logical operator→opposite logical operator; Mathematicalfunction→Inverse function.

Furthermore, and as discussed above, if a data asset has had multipledata edges applied in a specific order, the new process is created inthe following way: 1) traverse the functions that comprised the originalprocess in reverse order, and 2) for each function, add to the newprocess the compensating function.

The initial process may include the following flow of functions:divide(datum)→encode(datum)→compress(datum). A reversible process mayinclude:

expand(datum)→decode(datum)→multiply(datum).

Lastly, sometimes when executing the described embodiments, the datacannot be fully reconstructed. Nevertheless, it can be valuable toexecute the techniques described herein anyway as doing so may at leastprovide a partial data reconstruction. Examples of where the data canonly be partially reconstructed may include two downstream processesread from the data asset, but only one of them may be reverse run.Another example includes two upstream processes that write to the dataasset, but only one of them can be rerun. In this case the downstreamprocess is only partially reversible. However, the upstream ordownstream data sources have been updated since the processes ran last.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention. The computer readable storage medium can be atangible device that can retain and store instructions for use by aninstruction execution device.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of onemore other features, integers, steps, operations, element components,and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

What is claimed is:
 1. A system for data asset reconstruction,comprising: a memory having computer readable instructions; and aprocessor for executing the computer readable instructions, the computerreadable instructions including: receiving a first data lineage for afirst lost data asset, wherein the first data lineage identifies a firstdata source connected to the first lost data asset by a firstintermediate process, the first data source is downstream from the firstlost data asset in the first data lineage, and the first intermediateprocess includes a process that was applied to the first lost data assetto yield the first data source; determining whether the firstintermediate process can be used to reconstruct the first lost dataasset; based on determining that the first intermediate process can beused to reconstruct the first lost data asset, including determiningthat the first intermediate process is reversible, reconstructing thefirst lost data asset by reversing the first intermediate process fromthe first data source to yield the first lost data asset; identifying asecond lost data asset of the first data source upon whichreconstruction of the first lost data asset depends; receiving a seconddata lineage for the second lost data asset, wherein the second datalineage identifies at least a second data source connected to the secondlost data asset by a second intermediate process, the second data sourceis upstream from the second lost data asset in the second data lineage;and based on determining that the second intermediate process isre-runnable, reconstructing the second lost data asset by re-running thesecond intermediate process from the second data source to yield thesecond lost data asset prior to reconstructing the first lost dataasset, wherein the first intermediate process is reversible if the firstintermediate process is capable of being run in reverse to create thefirst lost data asset as output using the first data source as input,and wherein the second intermediate process is re-runnable if the secondintermediate process did not change the second data source or if thesecond intermediate process is a known one-to-one function.